On a planar matching in line segments endpoints visibility graph
نویسنده
چکیده
We show that the segment endpoint visibility graph of any finite set of 2n line segments contains a planar matching that does not use any segment edge, if the line segments in our set are convexly independent.
منابع مشابه
Planar segment visibility graphs
Given a set of n disjoint line segments in the plane, the segment visibility graph is the graph whose 2n vertices correspond to the endpoints of the line segments and whose edges connect every pair of vertices whose corresponding endpoints can see each other. In this paper we characterize and provide a polynomial time recognition algorithm for planar segment visibility graphs. Actually, we char...
متن کاملVisibility Drawings of Plane 3-Trees with Minimum Area
A visibility drawing of a plane graph G is a drawing of G where each vertex is drawn as a horizontal line segment and each edge is drawn as a vertical line segment such that the line segments use only grid points as their endpoints. The area of a visibility drawing is the area of the smallest rectangle on the grid which encloses the drawing. A minimum-area visibility drawing of a plane graph G ...
متن کاملComputing the Visibility Polygons of the Endpoints of a Set of Line Segments in Output Sensitive Time
Given a set S of n non-intersecting line segments in the plane, we present an algorithm that computes the 2n visibility polygons of the endpoints of S, in output sensitive time. The algorithm relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depthrst search. One extension of this result is ...
متن کاملVisibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adjacent nodes are vertically visible to each other. If G is a plane graph, i.e., a planar graph equipped with a planar embedding, a visibility representation of G has the additional requirement of reflecting the given pl...
متن کاملImproved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
Let G be an n-node planar graph. In a visibility representation of G, each node of G is represented by a horizontal line segment such that the line segments representing any two adjacent nodes of G are vertically visible to each other. In the present paper we give the best known compact visibility representation of G. Given a canonical ordering of the triangulated G, our algorithm draws the gra...
متن کامل